A Multidimensional Bisection Method for Minimizing Function over Simplex
نویسندگان
چکیده
A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the method for class of strictly unimodal functions including class of strictly convex functions is proved. The computational results are presented for a set of test problems.
منابع مشابه
A Multidimensional Bisection Method for Unconstrained Minimization Problem
An extension of a new multidimensional bisection method for minimizing function over simplex is proposed for solving nonlinear unconstrained minimization problem. The method does not require a differentiability of function, and is guaranteed to converge to the minimizer for the class of strictly unimodal functions. The computational results demonstrating an effectiveness of algorithm for minimi...
متن کاملSimplex Qp-based Methods for Minimizing a Conic Quadratic Objective over Polyhedra
We consider minimizing a conic quadratic objective over a polyhedron. Such problems arise in parametric value-at-risk minimization, portfolio optimization, and robust optimization with ellipsoidal objective uncertainty; and they can be solved by polynomial interior point algorithms for conic quadratic optimization. However, interior point algorithms are not well-suited for branch-and-bound algo...
متن کاملMinimization of L2-sensitivity for L2-D separable-denominator state-space digital filters subject to L2-scaling constraints using a lagrange function and a bisection method
Abstract: The problem of minimizing l2-sensitivity subject to l2-scaling constraints for two-dimensional (2-D) separable-denominator state-space digital filters is investigated. The coefficient sensitivity of the filter is analized by using a pure l2-norm. An iterative algorithm for minimizing an l2-sensitivity measure subject to l2-scaling constraints is then explored by introducing a Lagrange...
متن کاملA Weak Compatibility Condition for Newest Vertex Bisection in any dimension
We define a weak compatibility condition for the Newest Vertex Bisection algorithm on simplex grids of any dimension and show that using this condition the iterative algorithm terminates successfully. Additionally we provide an O(n) algorithm that renumbers any simplex grid to fulfil this condition. Furthermore we conduct experiments to estimate the distance to the standard compatibility and al...
متن کاملA Portable System for Multidimensional Minimization
Nature ofphysical problem A lot of problems in physics, chemistry, applied mathematics as well as in engineering and in other fields, are quite often reduced tominimizing a function of several variables. MERLIN is a system designed to minimize a multidimensional function. Method of solution Six algorithms are implemented. Three of them make use of the function’s gradient and hence are suitable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007